Equitable Colorings of Bounded Treewidth Graphs
نویسندگان
چکیده
A proper coloring of a graph G is equitable if the sizes of any two color classes are differ by at most one. The related notion is `-bounded coloring where each of the color classes is of cardinality ≤ `. We consider the problems to determine for a given graph G (and a given integer `) whether G has an equitable (`-bounded) coloring. We prove that both problems can be solved in polynomial time on graphs of bounded treewidth.
منابع مشابه
Not So Easy Problems for Tree Decomposable Graphs
We consider combinatorial problems for graphs that (a) can be solved in polynomial time for graphs of bounded treewidth and (b) where the order of the polynomial time bound is expected to depend on the treewidth of the considered graph. First we review some recent results for problems regarding list and equitable colorings, general factors, and generalized satisfiability. Second we establish a ...
متن کاملPerfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کاملRandomly coloring graphs of bounded treewidth
We consider the problem of sampling a proper k-coloring of a graph of maximal degree ∆ uniformly at random. We describe a new Markov chain for sampling colorings, and show that it mixes rapidly on graphs of bounded treewidth if k ≥ (1 + )∆, for any > 0.
متن کاملRecoloring bounded treewidth graphs
Let k be an integer. Two vertex k-colorings of a graph are adjacent if they differ on exactly one vertex. A graph is k-mixing if any proper k-coloring can be transformed into any other through a sequence of adjacent proper k-colorings. Any graph is (tw + 2)-mixing, where tw is the treewidth of the graph (Cereceda 2006). We prove that the shortest sequence between any two (tw + 2)-colorings is a...
متن کاملNonrepetitive colorings of graphs of bounded tree-width
A sequence of the form s1s2 . . . sms1s2 . . . sm is called a repetition. A vertex-coloring of a graph is called nonrepetitive if none of its paths is repetitively colored. We answer a question of Grytczuk [5] by proving that every outerplanar graph has a nonrepetitive 12-coloring. We also show that graphs of tree-width t have nonrepetitive 4-colorings.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 349 شماره
صفحات -
تاریخ انتشار 2004